Deadlock in Operating System: Definition, Conditions, Examples, Prevention, Avoidance & Recovery
Introduction
In an Operating System, multiple processes run simultaneously and compete for limited system resources such as CPU, memory, files, and I/O devices. Sometimes, a situation arises where a group of processes are unable to proceed because each process is waiting for a resource that is held by another process in the same group. This situation is known as Deadlock.
Deadlock is one of the most important and frequently asked topics in Operating System (OS) for university exams, interviews, and competitive examinations. Understanding deadlock helps students design efficient systems and avoid serious performance problems.
In this article, we will study Deadlock in Operating System in detail, including its definition, necessary conditions, real-life examples, methods for handling deadlock, and important exam points.
This article is specially written for Computer Science students preparing for university exams, GATE, and technical interviews.
What is Deadlock?
A deadlock is a condition in which a set of processes are permanently blocked because each process holds a resource and waits for another resource that is held by some other process.
In simple words: no process can continue execution, and the system comes to a standstill.
Formal Definition
- Process P1 is waiting for a resource held by P2
- Process P2 is waiting for a resource held by P1
As a result, both processes wait forever.
Real-Life Example of Deadlock
- Person A holds a pen and wants a notebook.
- Person B holds a notebook and wants a pen.
Neither person is willing to release the resource they already have. As a result, both keep waiting forever. This is exactly how deadlock happens in an operating system.
Deadlock Example in Operating System
| Process | Holds | Requests |
|---|---|---|
| P1 | R1 | R2 |
| P2 | R2 | R1 |
Both processes are waiting for each other’s resources. Hence, a deadlock occurs.
Necessary Conditions for Deadlock (Coffman Conditions)
1. Mutual Exclusion
At least one resource must be held in a non-shareable mode.
Example: Printer, scanner, file write access.
2. Hold and Wait
A process must be holding at least one resource and waiting to acquire additional resources that are currently held by other processes.
3. No Preemption
Resources cannot be forcibly taken away from a process. A process releases resources only after completing its task.
4. Circular Wait
- P1 waits for P2
- P2 waits for P3
- Pn waits for P1
If all four conditions are true, deadlock will definitely occur.
Resource Allocation Graph (RAG)
- Processes – Circles
- Resources – Squares
- Request edge – Process to Resource
- Assignment edge – Resource to Process
If the resource allocation graph contains a cycle, deadlock may or may not occur.
Methods for Handling Deadlock
- Deadlock Prevention
- Deadlock Avoidance
- Deadlock Detection
- Deadlock Ignorance
Methods for Handling Deadlock
1. Deadlock Prevention
Ensure at least one deadlock condition never occurs.
2. Deadlock Avoidance
Uses Banker’s Algorithm to check safe state before allocation.
3. Deadlock Detection
Allows deadlock and then detects it using wait-for graphs.
4. Deadlock Ignorance
Assumes deadlock never occurs (Ostrich Algorithm).
Difference Between Deadlock and Starvation
| Deadlock | Starvation |
|---|---|
| Processes wait forever | Process waits for a long time |
| Circular waiting | No circular wait |
| Permanent block | Temporary delay |
Conclusion
Deadlock is a critical concept in Operating Systems that occurs due to improper resource allocation among competing processes. By understanding deadlock conditions and handling techniques, system designers can build efficient and reliable systems.
Every Computer Science student must clearly understand deadlock, as it is a core topic for exams, interviews, and practical system design.
If you found this article helpful, share it with your classmates and explore other Operating System topics on CSE Gyan.
© 2026 CSE Gyan. All Rights Reserved.